Complexity of Non-Monotonic Logics
نویسندگان
چکیده
Over the past few decades, non-monotonic reasoning has developed to be one of the most important topics in computational logic and artificial intelligence. The non-monotonicity here refers to the fact that, while in usual (monotonic) reasoning adding more axioms leads to potentially more possible conclusions, in non-monotonic reasoning adding new facts to a knowledge base may prevent previously valid conclusions. Different ways to introduce non-monotonic aspects to classical logic have been considered:
منابع مشابه
On the Intertranslatability of Autoepistemic, Default and Priority Logics, and Parallel Circumscription
This paper concentrates on comparing the relative expressive power of ve non-monotonic logics that have appeared in the literature. The results on the computational complexity of these logics suggest that these logics have very similar expressive power that exceeds that of classical monotonic logic. A reened classiication of non-monotonic logics by their expressive power can be obtained using t...
متن کاملProof Complexity of Non-classical Logics
Proof complexity is an interdisciplinary area of research utilising techniques from logic, complexity, and combinatorics towards the main aim of understanding the complexity of theorem proving procedures. Traditionally, propositional proofs have been the main object of investigation in proof complexity. Due their richer expressivity and numerous applications within computer science, also non-cl...
متن کاملDescription Logics with Circumscription
We show that circumscription can be used to extend description logics (DLs) with non-monotonic features in a straightforward and transparent way. In particular, we consider extensions with circumscription of the expressive DLsALCIO and ALCQO and prove that reasoning in these logics is decidable under a simple restriction: only concept names can be circumscribed, and role names vary freely durin...
متن کاملA Survey on Complexity Results for Non-monotonic Logics
This paper surveys the main results appeared in the literature on the computational complexity of non-monotonic inference tasks. We not only give results about the tractability/intractability of the individual problems but we also analyze sources of complexity and explain intuitively the nature of easy/hard cases. We focus mainly on non-monotonic formalisms, like default logic, autoepistemic lo...
متن کاملTableau Calculi for KLM Logics: extended version
We present tableau calculi for some logics of nonmonotonic reasoning, as defined by Kraus, Lehmann and Magidor. We give a tableau proof procedure for all KLM logics, namely preferential, loop-cumulative, cumulative and rational logics. Our calculi are obtained by introducing suitable modalities to interpret conditional assertions. We provide a decision procedure for the logics considered, and w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Bulletin of the EATCS
دوره 102 شماره
صفحات -
تاریخ انتشار 2010